CODING AND DECODING QC-LDPC CODES WITH ORTOGONALITY IN PAIRS OF ADJACENT LINES IN THEIR BASE MATRICE

专利摘要:
Certain aspects of the present disclosure provide near-cyclic low density parity verification codes (QC-LDPC) having orthogonality in pairs of adjacent lines from the corresponding base matrices, and a new decoder (eg, layer decoder) that exploits the orthogonality of the line in pairs for flexible programming of the decoder without loss of performance, for example, decoding sequentially line by line in the base matrix or decoding the orthogonal line pairs in the base matrix each time. An apparatus includes a receiver configured to receive a code word according to radio technology over a wireless channel via one or more antenna elements located close to the receiver. The apparatus includes at least one processor coupled with a memory and comprising a set of decoder circuits configured to decode the codeword based on a QC-LDPC code to produce a set of information bits. The LDPC code is stored in memory and defined by a base matrix having columns in which all adjacent lines are orthogonal in the last portion of the lines.
公开号:BR112019025741A2
申请号:R112019025741-1
申请日:2018-06-08
公开日:2020-06-23
发明作者:Richardson Thomas；Thomas Richardson；Binamira Soriaga Joseph；Joseph Binamira Soriaga；Kudekar Shrinivas；Shrinivas KUDEKAR；Sarkis Gabi；Gabi SARKIS
申请人:Qualcomm Incorporated；
IPC主号:

专利说明:

[0001] [0001] This application claims benefit and priority to US Provisional Patent Application Serial No. 62 / 517,916, filed on June 10, 2017, US Provisional Patent Application Serial 62 / 522,044, filed on June 19, 2017 and US Patent Application No. 16 / 003,047, filed June 7, 2018. All three applications are hereby incorporated by reference in their entirety, as if it were fully defined below and for all applicable purposes. TECHNICAL FIELD
[0002] [0002] Aspects of the present disclosure refer to wireless communications and, more particularly, to techniques for encryption using low density parity verification codes (LDPC). In some embodiments, LDPC codes may be organized or orthogonal in pairs of adjacent lines in a parity check matrix (PCM) that describes the code. The modalities also include new modules (for example, hardware), such as a new encoder / decoder configured to leverage LDPC encoding with line orthogonality in pairs to perform flexible encoder / decoder programming without loss of performance and advantageous hardware processing. INTRODUCTION
[0003] [0003] Wireless communication systems are widely deployed to provide various telecommunications services, such as telephony, video, data, messages, transmissions, etc. These wireless communication systems can employ multiple access technologies capable of supporting communication with multiple users, sharing the system's available resources (for example, bandwidth, transmission power, etc.). Examples of such multiple access systems include the Long Term Evolution (LTE) systems of the 3rd Generation Partnership Project (3GPP), Advanced LTE systems (LTE-A), code division multiple access systems (CDMA), time division multiple access systems (TDMA), frequency division multiple access systems (FDMA), orthogonal frequency division multiple access systems (OFDMA), single operator frequency division multiple access systems (SC- FDMA) and multiple access systems by time division synchronous code (TD-SCDMA), to name a few.
[0004] [0004] In some examples, a wireless multiple access communication system may include a number of base stations (BSs), which are capable of simultaneously supporting communication to various communication devices, also known as user devices (UEs) . In an LTE or LTE-A network, a set of one or more base stations can define an eNodeB (eNB). In other examples (for example, in a next generation, a new radio (NR) or 5G network), a wireless multiple access communication system may include multiple distributed units
[0005] [0005] These multiple access technologies have been adopted in several telecommunications standards to provide a common protocol that allows different wireless devices to communicate at a municipal, national, regional and even global level. NR (for example, new radio or 5G) is an example of an emerging telecommunications standard. NR is a set of enhancements to the mobile LTE standard enacted by 3GPP. NR was designed to offer better support for mobile broadband Internet access, improving spectral efficiency, reducing costs, improving services, making use of a new spectrum and integrating better with other open standards using OFDMA with a cyclic prefix ( CP) in the downlink (DL) and uplink (UL). For these purposes, NR supports beam forming, multiple input and multiple output (MIMO) antenna technology and carrier aggregation.
[0006] [0006] Binary values (for example, ones and zeros) are used to represent and communicate various types of information, such as video, audio, statistical information, etc. Unfortunately, during the storage, transmission and / or processing of binary data, errors may occur unintentionally introduced; for example, a “1” can be changed to a “0” or vice versa.
[0007] [0007] Generally, in the case of data transmission, a receiver observes each bit received in the presence of noise or distortion and only an indication of the bit value is obtained. Under these circumstances, the observed values are interpreted as a source of “smooth” bits. A flexible bit indicates a preferred estimate of the bit value (for example, 1 or 0) along with some indication of the reliability of that estimate. Although the number of errors can be relatively low, even a small number of errors or level of distortion can result in the data becoming unusable or, in the case of transmission errors, it may require data retransmission. To provide a mechanism for checking errors and, in some cases, correcting errors, binary data can be encoded to introduce carefully designed redundancy. The coding of a data unit produces what is generally called a code word. Because of its redundancy, a codeword generally includes more bits than the input unit from which the codeword was produced.
[0008] [0008] The redundant bits are added by an encoder to the transmitted bit stream to create a codeword. When signals derived from transmitted code words are received or processed, the redundant information included in the code word as noted in the signal can be used to identify and / or correct errors or remove distortions from the received signal in order to recover the drive. original data. This error checking and / or correction can be implemented as part of a decoding process. In the absence of errors, or in the case of correctable errors or distortion, decoding can be used to recover the source data being processed, the original data unit that was encoded. In the case of unrecoverable errors, the decoding process may produce some indication that the original data cannot be fully recovered. Such decoding failure indications can be used to initiate the retransmission of data. As the use of fiber optic lines for data communication and the rate at which data can be read and stored on data storage devices (eg, disk drives, tapes, etc.) increases, the need increases efficient use of storage capacity and data transmission and also the ability to encode and decode data at high speed rates.
[0009] [0009] In the context of 3GPP's standardization efforts by 3GPP stakeholders and participants, TR.38.912 (Version 14.0.0, March 2017) outlined aspects related to the study items under consideration for NR to comply with IMT- plans 2020. An area related to channel coding (Section
[0010] [0010] The systems, methods and devices of the dissemination have several aspects, none of which is solely responsible for their desirable attributes. Without limiting the scope of this disclosure, as expressed by the following claims, some features will now be discussed shortly. After considering this discussion, and particularly after reading the “Detailed Description” section, we will understand how the features in this release provide benefits that include improved communications between access points and stations on a wireless network.
[0011] [0011] While encryption efficiency and high data rates are important, for an encoding and / or decoding system to be practical for use on a wide range of devices (eg consumer devices), it is also important that encoders and / or decoders can be implemented at a reasonable cost. The modalities of the present invention provide improved communication devices with new and improved hardware components, capable of performing new, improved encoding and decoding techniques. Encoders and decoders according to the modalities of the present invention may include features as discussed below to leverage LDPC encoding techniques. The modalities may include LDPC encoder / decoder circuitry comprising circuit features configured to perform efficient encoding and decoding techniques and considering the size of the device and considerations on operational design. Technical improvements can include faster hardware processing, resulting from encoding / decoding using an LPDC code based on the base chart with unique orthogonality arrangements.
[0012] [0012] Communication systems generally need to operate at several different rates. Low density parity check (LDPC) codes can be used for a simple implementation to provide encoding and / or decoding at different rates. For example, higher rate LDPC codes can be generated by puncturing lower rate LDPC codes.
[0013] [0013] As the demand for mobile broadband access continues to increase, there is a need for further improvements in NR technology. Preferably, the improvements may or should apply to other multiple access technologies and to the telecommunications standards that employ those technologies. One area for improvement is the coding / decoding area for data transmission. These improvements (for example, improved LDPC codes) may apply to NR and other access technologies.
[0014] [0014] Aspects of the present disclosure refer to the encoding of communications using LDPC codes that have orthogonality in pairs of adjacent lines in the corresponding parity check matrix (PCM) that describes the LDPC code and a new encoder / decoder that exploits LDPC encoding with pair line orthogonality to perform flexible encoder / decoder programming without loss of performance. The modalities can include circuits arranged and / or configured to perform encoding / decoding operations using LDPC codes with orthogonality in pairs. In some embodiments, an encoder or decoder may comprise at least one processor communicatively coupled to a memory device, the encoder or decoder may be configured to implement encoding or decoding LDPC codes using pairwise orthogonality arrangements.
[0015] [0015] Certain aspects provide a device for wireless communication by a receiving device. The device usually includes a receiver configured to receive a code word according to radio technology over a wireless channel via one or more antenna elements located near the receiver. The apparatus includes at least one processor coupled to a memory and comprising a set of decoder circuits configured to decode the codeword based on an LDPC code to produce a set of information bits. The LDPC code is stored in memory and defined by a base matrix having a first number of columns corresponding to variable nodes in a base chart and a second number of corresponding lines to check nodes in the base chart. For each of the first number of columns, all adjacent rows are orthogonal to a last portion of the second number of rows.
[0016] [0016] Certain aspects provide a device for wireless communication by a transmission device. The apparatus generally includes at least one processor coupled to a memory and comprising an encoder circuit configured to encode a set of bits of information based on an LDPC code to produce a codeword. The LDPC code is stored in memory and defined by a base matrix having a first number of columns corresponding to variable nodes in a base chart and a second number of corresponding lines to check nodes in the base chart. For each of the first number of columns, all adjacent rows are orthogonal to a last portion of the second number of rows. The apparatus includes a transmitter configured to transmit the code word according to a radio technology through a wireless channel through one or more antenna elements arranged close to the transmitter.
[0017] [0017] Certain aspects provide a method for wireless communication by a receiving device. The method usually includes receiving a code word according to a radio technology over a wireless channel via one or more antenna elements located near a receiver. The method includes decoding the codeword using the decoder circuitry based on an LDPC code to produce a set of information bits. The LDPC code is stored and defined by a base matrix having a first number of columns corresponding to variable nodes in a base chart and a second number of corresponding lines to check nodes in the base chart. For each of the first number of columns, all adjacent rows are orthogonal to a last portion of the second number of rows.
[0018] [0018] Certain aspects provide a method for wireless communication by a transmission device. The method generally includes encoding with encoder circuitry a set of bits of information based on an LDPC code to produce a codeword. The LDPC code is defined by a base matrix having a first number of columns corresponding to variable nodes in a base chart and a second number of corresponding lines to check nodes in the base chart. For each of the first number of columns, all adjacent rows are orthogonal to a last portion of the second number of rows. The method includes transmitting the code word according to a radio technology over a wireless channel through one or more antenna elements.
[0019] [0019] Certain aspects provide a device for wireless communication, such as a receiving device. The device usually includes means to receive a code word according to a radio technology over a wireless channel. The apparatus generally includes means for decoding the codeword based on an LDPC code to produce a set of information bits. The LDPC code is defined by a base matrix having a first number of columns corresponding to variable nodes in a base chart and a second number of corresponding lines to check nodes in the base chart. For each of the first number of columns, all adjacent rows are orthogonal to a last portion of the second number of rows.
[0020] [0020] Certain aspects provide a device for wireless communication, such as a transmission device. The apparatus generally includes means for encoding a set of bits of information based on an LDPC code to produce a codeword. The LDPC code is defined by a base matrix having a first number of columns corresponding to variable nodes in a base chart and a second number of corresponding lines to check nodes in the base chart. For each of the first number of columns, all adjacent rows are orthogonal to a last portion of the second number of rows. The device usually includes means to transmit the code word according to radio technology over a wireless channel.
[0021] [0021] Certain aspects provide a computer-readable medium having computer executable code stored in it for wireless communication. Computer executable code usually includes code to receive a code word according to radio technology over a wireless channel. Computer executable code usually includes code to decode the codeword based on an LDPC code to produce a set of bits of information. The LDPC code is defined by a base matrix having a first number of columns corresponding to variable nodes in a base chart and a second number of corresponding lines to check nodes in the base chart. For each of the first number of columns, all adjacent rows are orthogonal to a last portion of the second number of rows.
[0022] [0022] Certain aspects provide a computer-readable medium having computer executable code stored in it for wireless communication. Computer executable code generally includes code to encode a set of bits of information based on an LDPC code to produce a codeword. The LDPC code is defined by a base matrix having a first number of columns corresponding to variable nodes in a base chart and a second number of corresponding lines to check nodes in the base chart. For each of the first number of columns, all adjacent rows are orthogonal to a last portion of the second number of rows. Computer-executable code usually includes code to transmit the code word according to radio technology over a wireless channel.
[0023] [0023] Certain modalities may include a number of devices capable of communication. For example, some modalities may include portable consumer devices based on the user that comprise a compartment capable of retaining the internal circuitry. The internal circuitry can include one or more processors configured to carry out mobile communications and associated memory to store data and software. The internal circuitry may also include wireless modem features that include a decoder / encoder circuitry that can use LPDC codes to encode or decode information in wireless communication configurations. In another example, an apparatus may comprise: a transceiver capable of wireless communication with at least one wireless network node; and a processor coupled to the transceiver. The processor may comprise an encoder capable of encoding data to provide encoded data by performing operations comprising: encoding the data with a low density parity check code (LDPC) having recommended orthogonality in line to provide LDPC encoded data. The processor may comprise a decoder capable of decoding data to provide decoded data by performing operations comprising: decoding data with a low density parity check code (LDPC) having inline orthogonality recommended to provide decoded LDPC data.
[0024] [0024] For the achievement of the previous and related purposes, the one or more aspects comprise the resources described below completely and particularly pointed out in the claims. The following description and the accompanying drawings set out in detail certain characteristics illustrating one or more aspects. These characteristics are indicative, however, of just a few of the many ways in which the principles of various aspects can be employed. BRIEF DESCRIPTION OF THE DRAWINGS
[0025] [0025] So that the way in which the characteristics cited above of the present disclosure can be understood in detail, a more particular description, briefly summarized above, can be obtained by reference to aspects, some of which are illustrated in the drawings. It should be noted, however, that the attached drawings illustrate only certain aspects typical of this disclosure and, therefore, should not be considered limiting its scope, as the description may admit other equally effective aspects.
[0026] [0026] Figure 1 is a block diagram that conceptually illustrates an example of a telecommunications system, according to certain aspects of the present disclosure.
[0027] [0027] Figure 2 is a block diagram that illustrates an example of the logical architecture of a distributed radio access network (RAN), according to certain aspects of the present disclosure.
[0028] [0028] Figure 3 is a diagram that illustrates an example of physical architecture of a distributed RAN, according to certain aspects of the present disclosure.
[0029] [0029] Figure 4 is a block diagram that conceptually illustrates a design of an example base station (BS) and user equipment (UE), in accordance with certain aspects of the present disclosure.
[0030] [0030] Figure 5 is a diagram showing examples for implementing a communication protocol stack, according to certain aspects of the present disclosure.
[0031] [0031] Figure 6 illustrates an example of a frame format for a new radio (NR) system, according to certain aspects of the present disclosure.
[0032] [0032] Figures 7 - 7A show graphical and matrix representations of an example of low density parity verification code (LDPC), in accordance with certain aspects of the present disclosure.
[0033] [0033] Figure 8 is an elevated bipartite graph that illustrates the elevation of the LDPC code in Figure 7A, according to certain aspects of the present disclosure.
[0034] [0034] Figure 9 is a block diagram illustrating an encoder, in accordance with certain aspects of the present disclosure.
[0035] [0035] Figure 10 is a block diagram illustrating a decoder, according to certain aspects of the present disclosure.
[0036] [0036] Figure 11 is an example of a generalized structure of an LDPC code base matrix, according to certain aspects of the present disclosure.
[0037] [0037] Figure 12 is an example of an LDPC code base matrix, according to certain aspects of the present disclosure.
[0038] [0038] Figure 13 illustrates a communications device that can include various components configured to perform operations for the techniques disclosed here in accordance with aspects of the present disclosure.
[0039] [0039] Figure 14 is a flow diagram illustrating an example of operations for wireless communication by a receiving device using LDPC encryption, in accordance with certain aspects of the present disclosure.
[0040] [0040] Figure 15 is a flow diagram illustrating an example of operations for wireless communication by a transmission device using LDPC encryption, in accordance with certain aspects of the present disclosure.
[0041] [0041] To facilitate understanding, identical reference numbers were used, whenever possible, to designate identical elements that are common to the figures. It is contemplated that the elements disclosed in one aspect can be used beneficially in other aspects without specific recitation. DETAILED DESCRIPTION
[0042] [0042] Aspects of this disclosure provide apparatus, methods, processing systems and computer-readable media for encoding communications using low density parity verification codes (LDPC) that have orthogonality in pairs of adjacent lines in the verification matrix corresponding parity (PCM) describing the LDPC code.
[0043] [0043] The following description provides examples and does not limit the scope, applicability or examples set out in the claims. Changes can be made to the function and arrangement of the elements discussed without departing from the scope of the disclosure. Various examples may omit, replace, or add various procedures or components, as appropriate. For example, the methods described can be performed in a different order than described and several steps can be added, omitted or combined. In addition, the features described in relation to some examples can be combined into other examples. For example, an apparatus can be implemented or a method can be practiced using any number of the aspects set out here. In addition, the scope of the disclosure is intended to cover such apparatus or method that is practiced using another structure, functionality or structure and functionality in addition to, or which are not, the various aspects of the disclosure set forth herein. It should be understood that any aspect of the disclosure disclosed herein may be incorporated by one or more elements of a claim. The word "example" is used here to mean "to serve as an example, instance or illustration". Any aspect described here as "exemplary" should not necessarily be interpreted as preferred or advantageous over other aspects.
[0044] [0044] The techniques described here can be used for various wireless communication technologies, such as LTE, CDMA, TDMA, FDMA, OFDMA, OFDMA, SC-FDMA and other networks. The terms "network" and "system" are often used interchangeably. A CDMA network can implement radio technology Universal access via terrestrial radio (UTRA), cdma2000, etc. UTRA includes broadband CDMA (WCDMA) and other variants of CDMA. The cdma2000 covers the IS-2000, IS-95 and IS-856 standards. A TDMA network can implement radio technology like the Global Mobile Communications System (GSM). An OFDMA network can implement radio technology such as NR (for example, RA 5G), evolved UTRA (E-UTRA), ultra-mobile broadband (UMB), IEEE 802.11 (Wi-Fi), IEEE 802.16 (WiMAX), IEEE
[0045] [0045] Nova Rádio (NR) is an emerging wireless communication technology under development in conjunction with the 5G Technology Forum (5GTF). The Long Term Evolution of 3GPP (LTE) and LTE-Advanced (LTE-A) are launches of UMTS that use E-UTRA. UTRA, E-UTRA, UMTS, LTE, LTE-A and GSM are described in documents from an organization called “Third Generation Partnership Project” (3GPP). Cdma2000 and UMB are described in documents from an organization called “Third Generation Partnership Project 2” (3GPP2). The techniques described here can be used for the wireless networks and radio technologies mentioned above, as well as other wireless networks and radio technologies. For clarity, although aspects may be described in this document using terminology commonly associated with 3G and / or 4G wireless technologies, aspects of the present disclosure can be applied to other generation-based communication systems, such as 5G and later, including communication technologies. NR.
[0046] [0046] New radio (NR) access (for example, 5G technology) can support several wireless communication services, such as enhanced mobile broadband (eMBB) targeting broadband (for example, 80 MHz or more), millimeter wave (mmW) targeting high carrier frequency (for example, 25 GHz or more), massive MTC for machine communications (mMTC) targeting MTC techniques not compatible with previous versions and / or mission critical targeting ultra reliable low latency communications ( URLLC). These services may include latency and reliability requirements. These services may also have different transmission time intervals (TTI) to meet the respective quality of service (QoS) requirements. In addition, these services can coexist in the same subframe.
[0047] [0047] Although aspects and modalities are described in this specification by illustration to some examples, people skilled in the art will understand that additional implementations and use cases can occur in many different arrangements and scenarios. The innovations described here can be implemented on many different types of platforms, devices, systems, shapes, sizes, packaging arrangements. For example, modalities and / or uses may arise through integrated modalities of chips and other devices based on non-modular components (for example, end-user devices, vehicles, communication devices, computing devices, industrial equipment, retail / shopping, medical devices, AI enabled devices, etc.). Although some examples may or may not be specifically targeted to use cases or applications, there may be a wide range of applicability of the innovations described. The implementations can cover a spectrum of modular or chip-level components to non-modular and chip-level implementations, in addition to aggregated, distributed or OEM devices or systems, incorporating one or more aspects of the described innovations. In some practical configurations, devices that incorporate aspects and features described may also necessarily include additional components and resources for implementing and practicing claimed and described modalities. For example, wireless signal transmission and reception necessarily includes several components for analog and digital purposes (for example, hardware components, including antennas, antenna settings arranged or located components near the receiver or transmitter, RF chains, amplifiers, power, modulators, buffer, processor (s), interleaver, adder / adder, etc.). It is intended that the innovations described here can be practiced on a wide variety of devices, components at the chip level, systems, distributed arrangements, end-user devices, etc. of varying sizes, shapes and constitutions. Wireless Communication System Example
[0048] [0048] Figure 1 illustrates an example of wireless communication network 100 in which aspects of the present disclosure can be performed. For example, wireless communication network 100 can be a New Radio (NR) or 5G network. The NR network may use low density parity check (LPDC) encoding for certain transmissions, in accordance with certain aspects of the present disclosure. For example, a transmission device, such as a base station (BS) 110 on the downlink or user equipment (UE) 120 on the uplink, can encode bits of information for transmission to a receiving device on the wireless communication network 100. The transmission device encodes information bits for certain transmissions using LDPC code. The base graph associated with the LDPC code may have line orthogonality in pairs on a lower portion of the base graph.
[0049] [0049] As illustrated in Figure 1, the wireless communication network 100 may include a number of base stations (BSs) 110 and other entities on the network. A BS can be a station that communicates with user equipment (UEs). Each BS 110 can provide communication coverage for a specific geographic area. In 3GPP, the term “cell” can refer to a coverage area of a B node (NB) and / or an NB subsystem serving that coverage area, depending on the context in which the term is used. In NR systems, the term “cell” and the next generation of NB (gNB or gNodeB), NR of NR, NB 5G, access point (AP) or transmission reception point (TRP) can be interchangeable. In some instances, a cell may not necessarily be stationary and the cell's geographic area may move according to the location of a mobile BS. In some examples, base stations can be interconnected to each other and / or to one or more other base stations or network nodes (not shown) on wireless communication network 100 through various types of callback interfaces, such as a connection direct physical, a wireless connection, virtual network or the like, using any suitable transport network.
[0050] [0050] In general, any number of wireless networks can be deployed in a given geographic area.
[0051] [0051] A BS can provide communication coverage for a macro cell, a peak cell, a femto cell and / or other types of cells. A macro cell can cover a relatively large geographical area (for example, several kilometers in radius) and can allow unrestricted access by UEs with a service subscription. A peak cell can cover a relatively small geographical area and can allow unrestricted access by UEs with a service subscription. A femto cell can cover a relatively small geographical area (for example, a house) and can allow restricted access by UEs that have an association with the femto cell (for example, UEs in a Closed Subscriber Group (CSG), UEs for users at home, etc.) A BS for a macro cell can be referred to as a BS macro. A BS for a peak cell can be referred to as a peak BS. A BS for a femto cell can be termed as a BS femto or a domestic BS. In the example shown in Figure 1, BSs 110a, 110b and 110c can be macro BSs for macro cells 102a, 102b and 102c, respectively. The BS 110x can be a peak BS for a 102x peak cell. BSs 110y and 110z can be BS femto for femto cells 102y and 102z, respectively. A BS can support one or more cells (for example, three).
[0052] [0052] The wireless communication network 100 may also include relay stations. A relay station is a station that receives a transmission of data and / or other information from an upstream station (for example, a BS or a UE) and sends a transmission of data and / or other information to a downstream station ( for example, a UE or a BS). A relay station can also be a UE that relays transmissions to other UEs. In the example shown in Figure 1, a relay station 110r can communicate with BS 110a and UE 120r, in order to facilitate communication between BS 110a and UE 120r. A relay station can also be called a relay BS, relay etc.
[0053] [0053] Wireless communication network 100 can be a heterogeneous network that includes BSs of different types, for example, BS macro, BS peak, BS femto, retransmissions, etc. These different types of BSs can have different levels of transmission power, different coverage areas, and different impact on interference on the wireless communication network 100. For example, the macro BS can have a high level of transmission power (for example , 20 Watts), while BS peak, BS femto and retransmissions may have a lower level of transmission power (for example, 1 Watt).
[0054] [0054] Wireless communication network 100 can support synchronous or asynchronous operation. For synchronous operation, BSs can have a similar frame delay and transmissions from different BSs can be approximately time aligned. For asynchronous operation, BSs may have a different frame time and transmissions from different BSs may not be time aligned. The techniques described here can be used for synchronous and asynchronous operation.
[0055] [0055] A network controller 130 can couple to a set of BSs and provide coordination and control for those BSs. The network controller 130 can communicate with BSs 110 via a backhaul. BSs 110 can also communicate (for example, directly or indirectly) via wireless or wired backhaul.
[0056] [0056] UEs 120 (e.g. 120x, 120y, etc.) can be dispersed throughout the wireless communication network 100 and each UE can be stationary or mobile. A UE can also be referred to as a mobile station, a terminal, an access terminal, a subscriber unit, a station, a customer site equipment (CPE), a cell phone, a smart phone, a personal digital assistant ( PDA), a wireless modem, a wireless communication device, a portable device, a laptop computer, a cordless phone, a local wireless loop station (WLL), a tablet computer, a camera, a device games, a netbook, a smartbook, an ultrabook, a device, a medical device or medical equipment, a biometric sensor / device, a wearable device such as a smart watch, smart clothes, smart glasses, a smart bracelet, smart jewelry ( for example, a smart ring, a smart bracelet, etc.), an entertainment device (for example, a music device, a video device, a satellite radio, etc.), a component or vehicle sensor r, an intelligent meter / sensor, industrially manufactured equipment, a global positioning system device or any other suitable device configured to communicate wirelessly or wired. Some UEs can be considered machine-type communication devices (MTC) or evolved MTC devices (eMTC). The MTC and eMTC UEs include, for example, robots, drones, remote devices, sensors, meters, monitors, location tags, etc., which can communicate with a BS, another device (for example, remote device) or some another entity. A wireless node can provide, for example, connectivity to or to a network (for example, a wide area network, such as the Internet or a cellular network) through a wired or wireless communication link. Some UEs can be considered Internet of Things (IoT) devices, which can be narrowband IoT devices (NB-IoT).
[0057] [0057] Certain wireless networks (for example, LTE) use orthogonal frequency division multiplexing (OFDM) in the downlink and single carrier frequency division multiplexing (SC-FDM) in the uplink. OFDM and SC-FDM partition the system's bandwidth into various orthogonal (K) subcarriers, which are also commonly called tones, compartments, etc. Each subcarrier can be modulated with data. In general, modulation symbols are sent in the frequency domain with OFDM and in the time domain with SC-FDM. The spacing between adjacent subcarriers can be fixed and the total number of subcarriers (K) can be dependent on the system's bandwidth. For example, the spacing of the subcarriers can be 15 kHz and the minimum allocation of resources (called “resource block” (RB)) can be 12 subcarriers (or 180 kHz). Consequently, the nominal size of Fast Fourier Transfer (FFT) can be 128, 256, 512, 1024 or 2048 for the system bandwidth of 1.25, 2.5, 5, 10 or 20 megahertz (MHz ), respectively. The system's bandwidth can also be partitioned into sub-bands. For example, a subband can cover 1.08 MHz (that is, 6 resource blocks) and there can be 1, 2, 4, 8, or 16 subbands for 1.25, 2, 5, 5, 10 or 20 MHz, respectively.
[0058] [0058] Although aspects of the examples described here may be associated with LTE technologies, aspects of the present disclosure may be applicable to other wireless communication systems, such as NR. NR can use OFDM with a CP in the uplink and downlink and include support for half-duplex operation using TDD. The beam conformation can be supported and the beam direction can be dynamically configured. MIMO transmissions with pre-coding can also be supported. The MIMO configurations on the DL can support up to 8 transmission antennas with multi-layered DL transmissions, up to 8 streams and up to 2 streams per UE. Multi-layered transmissions with up to 2 streams per EU can be supported. Multiple cell aggregation can be supported with up to 8 service cells.
[0059] [0059] In some examples, access to the air interface can be programmed, where a. A programming entity (for example, a base station) allocates resources for communication between some or all devices and equipment within its area or service cell. The programming entity may be responsible for programming, assigning, reconfiguring and releasing resources for one or more subordinate entities. That is, for scheduled communication, subordinate entities use resources allocated by the programmed entity. Base stations are not the only entities that can function as a programming entity. In some examples, a UE may function as a programming entity and may program resources for one or more subordinate entities (for example, one or more other UEs), and the other UEs may use the resources scheduled by the UE for wireless communication. In some examples, a UE can function as a programming entity in a point-to-point (P2P) network and / or a mesh network. In an example of a mesh network, UEs can communicate directly with each other, in addition to communicating with a programming entity.
[0060] [0060] In Figure 1, a solid line with double arrows indicates desired transmissions between a UE and a serving BS, which is a BS designated to serve the UE in the downlink and / or uplink. A finely dashed line with double arrows indicates interfering transmissions between a UE and a BS.
[0061] [0061] Figure 2 illustrates an example of a logical architecture of a distributed radio access network (RAN) 200, which can be implemented in the wireless communication network 100 illustrated in Figure 1. A 5G 206 access node can include a ANC 202. ANC 202 can be a central unit (CU) of distributed RAN 200. The backhaul interface for the next generation main network (NG-CN) 204 can end at ANC 202. The backhaul interface for access nodes next generation neighbors (NG-ANs) 210 may end at ANC 202. ANC 202 may include one or more TRPs 208 (for example, cells, BSs, gNBs, etc.).
[0062] [0062] The TRPs 208 can be a distributed unit (DU). TRPs 208 can be connected to a single ANC (for example, ANC 202) or more than one ANC (not shown). For example, for RAN sharing, radio as a service (RaaS) and service-specific AND deployments, TRPs 208 can be connected to more than one ANC. The 208 TRPs can each include one or more antenna ports. The TRPs 208 can be configured to serve individually (for example, dynamic selection) or together (for example, transmission together) traffic to a UE.
[0063] [0063] The logical architecture of the distributed RAN 200 can support fronthauling solutions in different types of deployment. For example, the logical architecture can be based on the transmission network resources (for example, bandwidth, latency and / or jitter).
[0064] [0064] The logical architecture of the distributed RAN 200 can share resources and / or components with LTE. For example, the next generation access node (NG-AN) 210 can support dual connectivity with NR and can share a common fronthaul for LTE and NR.
[0065] [0065] The logical architecture of the distributed RAN 200 can allow cooperation between and between TRPs 208, for example, within a TRP and / or between TRPs through ANC 202. An inter-TRP interface cannot be used.
[0066] [0066] The logical functions can be dynamically distributed in the logical architecture of the RAN 200 distributed. As will be described in more detail with reference to Figure 5, the radio resource control layer (RRC), Packet data convergence protocol layer (PDCP), radio link control layer (RLC), medium access control (MAC) and a physical layer (PHY) can be placed adaptively on the DU (for example, TRP 208) or CU (for example, ANC 202).
[0067] [0067] Figure 3 illustrates an example of physical architecture of a distributed RAN 300, according to aspects of the present disclosure. A centralized central network unit (C-CU) 302 can host main network functions. The C-CU 302 can be deployed centrally. The functionality of the C-CU 302 can be downloaded (for example, for advanced wireless services (AWS)), in an effort to handle peak capacity.
[0068] [0068] A centralized RAN unit (C-RU) 304 can host one or more ANC functions. Optionally, the C-RU 304 can host core network functions locally. The C-RU 304 may have a distributed deployment. The C-RU 304 can be dosed to the edge of the net.
[0069] [0069] A DU 306 can host one or more TRPs (Edge Node (EN), Edge Unit (UE), Radio Head (RH), Intelligent Radio Head (SRH)
[0070] [0070] Figure 4 illustrates an example of components of BS 110 and UE 120 (as shown in Figure 1), which can be used to implement aspects of the present disclosure. For example, antennas 452, processors 466, 458, 464, and / or controller / processor 480 of UE 120 and / or antennas 434, processors 420, 460, 438, and / or controller / processor 440 of BS 110 can be used to perform the various techniques and methods described here for LDPC encoding using LPDC codes having line orthogonality in pairs of adjacent lines in the PCM describing the code. For example, processors 466, 458, 464, and / or controller / processor 480 of UE 120 and / or processors 420, 460, 438, and / or controller / processor 440 of BS 110 may include an encoder and / or a decoder as described in more detail below in relation to Figure 9 and Figure 10, and can be configured for LDPC encoding using LPDC code with line orthogonality in pairs on adjacent lines of the corresponding PCM describing the LDPC code, according to certain aspects of this disclosure.
[0071] [0071] At BS 110, a transmission processor 420 can receive data from a data source 412 and control information from a controller / processor
[0072] [0072] At UE 120, antennas 452a to 452r can receive downlink signals from base station 110 and can provide received signals to demodulators (DEMODs) on transceivers 454a to 454r, respectively. Each demodulator 454 can condition (for example, filter, amplify, convert down and scan) a respective received signal to obtain input samples. Each demodulator can further process the input samples (for example, for OFDM, etc.) to obtain received symbols. A MIMO 456 detector can obtain symbols received from all demodulators 454a through 454r, perform MIMO detection on received symbols, if applicable, and provide detected symbols. A receiving processor 458 can process (e.g., demodulate, deinterleave and decode) the detected symbols, provide decoded data to the UE 120 to a data collector 460 and provide decoded control information to a controller / processor 480.
[0073] [0073] In the uplink, in the UE 120, a transmission processor 464 can receive and process data (for example, for the shared physical uplink channel (PUSCH)) from a 462 data source and control information (for example , for the controller / processor 480 physical uplink control (PUCCH) channel. The 464 transmission processor can also generate reference symbols for a reference signal (for example, the audible reference signal (SRS)). transmission processor 464 symbols can be pre-encoded by a TX MIMO 466 processor if applicable, further processed by demodulators on transceivers 454a to 454r (eg for SC-FDM, etc.) and transmitted to base station 110. On BS 110, UE 120 uplink signals can be received by antennas 434, processed by modulators 432, detected by a MIMO detector 436, if applicable, and later processed by a receiving processor 438 to obtain decoded data data and control information sent by UE 120. Receiving processor 438 can provide decoded data to a data warehouse 439 and decoded control information to controller / processor 440.
[0074] [0074] The controllers / processors 440 and 480 can direct the operation on BS 110 and UE 120, respectively. The 440 processor and / or other processors and modules in BS 110 can execute or direct the execution of processes for the techniques described in this document. Memories 442 and 482 can store data and program codes for BS 110 and UE 120, respectively. A 444 programmer can program UEs for data transmission on the downlink and / or uplink.
[0075] [0075] Figure 5 illustrates a diagram 500 showing examples for implementing a stack of communication protocols, according to aspects of the present disclosure. The illustrated communication protocol stacks can be implemented by devices that operate on a wireless communication system, such as a 5G system (for example, a system that supports uplink-based mobility). Diagram 500 illustrates a stack of communication protocols including a layer of RRC 510, a layer of PDCP 515, a layer of RLC 520, a layer of MAC 525 and a layer PHY 530. In several examples, the layers of a stack of Protocols can be implemented as separate software modules, parts of a processor or ASIC, parts of unposted devices connected by a communications link or various combinations of them. Placed and unplaced implementations can be used, for example, in a protocol stack for a network access device (for example, ANs, CUs and / or DUs) or a UE.
[0076] [0076] A first option 505-a shows a split implementation of a protocol stack, in which the implementation of the protocol stack is split between a centralized network access device (for example, an ANC 202 in Figure 2) and a access device to the distributed network (for example, DU 208 in Figure 2). In the first option 505-a, a layer of RRC 510 and a layer of PDCP 515 can be implemented by the central unit and a layer of RLC 520, a layer of MAC 525 and a layer PHY 530 can be implemented by the DU. In several examples, CU and DU can be placed or not placed. The first option 505-a can be useful in a macro cell, micro cell or peak cell implantation.
[0077] [0077] A second option 505-b shows a unified implementation of a protocol stack, in which the protocol stack is implemented on a single network access device. In the second option, the RRC 510 layer, the PDCP 515 layer, the RLC 520 layer, the MAC 525 layer and the PHY 530 layer can each be implemented by the AN. The second option 505-b can be useful in, for example, a femto cell implantation.
[0078] [0078] Regardless of whether a network access device implements part or all of a protocol stack, a UE can implement an entire protocol stack as shown in 505-c (for example, the RRC 510 layer, the PDCP layer 515, the RLC layer 520, the MAC layer 525 and the PHY layer 530).
[0079] [0079] In LTE, the basic transmission time interval (TTI) or packet duration is the 1 ms subframe. In NR, a subframe still has 1 ms, but the basic TTI is called a partition. A subframe contains a variable number of partitions (for example, 1, 2, 4, 8, 16, ... partitions) depending on the spacing of the subcarrier. The NR RB are 12 consecutive frequency subcarriers. The NR can support a spacing of the base subcarrier of 15 KHz and another spacing of the subcarrier can be defined with respect to the spacing of the subcarrier, for example, 30 kHz, 60 kHz, 120 kHz, 240 kHz, etc. subcarrier spacing. The length of the CP also depends on the spacing of the subcarrier.
[0080] [0080] Figure 6 is a diagram showing an example of a 600 frame format for NR. The transmission timeline for each of the downlink and uplink can be partitioned into radio frame units. Each radio frame can have a predetermined duration (for example, 10 ms) and can be partitioned into 10 subframes, each 1 ms, with indexes from 0 to 9. Each subframe can include a variable number of partitions depending on the spacing of subcarrier. Each partition can include a variable number of symbol periods (for example, 7 or 14 symbols) depending on the subcarrier spacing. Symbol periods in each partition can be assigned indexes. A mini-partition is a sub-partition structure (for example, 2, 3, or 4 symbols).
[0081] [0081] Each symbol in a partition can indicate a link direction (for example, DL, UL or flexible) for data transmission and the link direction for each subframe can be switched dynamically. The link instructions can be based on the partition format. Each partition can include DL / UL data, as well as DL / UL control information.
[0082] [0082] In NR, a block of synchronization signal (SS) is transmitted. The SS block includes a PSS, an SSS and a two-symbol PBCH. The SS block can be transmitted in a fixed partition location, like the symbols 0 - 3, as shown in Figure 6. The PSS and SSS can be used by the UEs for research and cell acquisition. PSS can provide half frame timing, SS can provide CP length and frame timing. PSS and SSS can provide the cell's identity. The PBCH carries some basic system information (SI), such as bandwidth of the downlink system, timing information on the radio frame, periodicity of the SS burst set, system frame number, etc. SS blocks can be arranged in bursts of SS to support beam scanning. Additional system information, such as minimum remaining system information (RMSI), system information blocks (SIBs), other system information (OSI), can be transmitted on a PDSCH in certain subframes.
[0083] [0083] In some circumstances, two or more subordinate entities (eg UEs) can communicate using side link signals. The actual applications of these side-link communications may include public security, proximity services, EU-to-network retransmission, vehicle-to-vehicle (V2V) communications, Internet of Everything (IoE) communications, IoT communications,
[0084] [0084] An UE can operate in various configurations of radio resources, including a configuration associated with the transmission of pilots using a dedicated set of resources (for example, a state dedicated to the control of radio resources (RRC), etc.) or a configuration associated with pilot transmission using a common set of resources (for example, a common RRC state, etc.). When operating in the dedicated state of RRC, the UE can select a dedicated set of resources to transmit a pilot signal to a network. When operating in the common state of RRC, the UE can select a common set of resources to transmit a pilot signal to the network. In either case, a pilot signal transmitted by the UE can be received by one or more network access devices, such as an AN or DU, or portions thereof. Each receiving network access device can be configured to receive and measure pilot signals transmitted in the common set of resources and also receive and measure pilot signals transmitted in dedicated sets of resources allocated to the UEs to which the network access device is a member. a set of monitoring devices for network access to the UE. One or more devices to access the receiving network or a UC to which the devices to access the transmission network transmit the measurements of the pilot signals, can use the measurements to identify cells serving to the UEs or to initiate a change in the server cell for one or more of the UEs. Error Correction Coding Example
[0085] [0085] Many communication systems (for example, like NR) use error correction codes. Error correction codes generally compensate for the lack of intrinsic reliability of information transfer (for example, over the air) in these systems, introducing redundancy in the data flow. Low density parity check codes (LDPC) are a type of error correction code that uses an iterative coding system. Gallager codes are an example of “regular” LDPC codes. Regular LDPC codes are linear block codes in which most of the elements of your H parity check matrix (PCM) are "0".
[0086] [0086] LDPC codes can be represented by bipartite graphs (usually called "Tanner graphs"). In a bipartite graph, a set of variable nodes corresponds to bits of a code word (for example, bits of information or systematic bits) and a set of check nodes corresponds to a set of parity check constraints that define the code . The borders on the graph connect variable nodes to check the nodes. Thus, the graph's nodes are separated into two distinct sets and with borders connecting nodes of two different types, variable and verification.
[0087] [0087] The graphics as used in LDPC encoding can be characterized in several ways. An elevated code is created by copying a two-part base chart (G) several times, N. The number of copies or elevations can be called the elevation size or elevation size value Z. A variable node and a check node are considered “Neighbors” if they are connected by an “edge” (that is, the line connecting the variable node and the verification node) in the split graph. For each edge (e) of the bipartite base graph, a permutation is applied to the N copies of the edge (e) to interconnect the N copies of G. A bit sequence having a one-to-one association with the variable node sequence is one valid codeword if and only if, for each verification node (also known as a restriction node), the bits associated with all neighboring variable nodes add up to module 2, that is, include an even number of 1s. The resulting LDPC code can be quasi-cyclic (QC) if the permutations used are cyclic. Cyclic permutations applicable to edges can be called elevation values or cyclic elevation values. Elevation values are represented by a k value of an entry in the PCM.
[0088] [0088] Figures 7 - 7A show graphical and matrix representations of an exemplary LDPC code, respectively, according to certain aspects of the present disclosure. Figure 7 shows a split graph 700 representing an example of LDPC code. The split graph 700 includes a set of five variable nodes 710 (represented by circles) connected to four verification nodes 720 (represented by squares). The edges in graphic 700 connect variable nodes 710 to verification nodes 720 (represented by the lines connecting variable nodes 710 to verification nodes 720). The split graph 700 consists of | V | = 5 variable nodes and | C | = 4 verification nodes, connected by | E | = 12 edges.
[0089] [0089] The bipartite graph 700 can be represented by a simplified adjacency matrix. Figure 7A shows a matrix representation 700A of bipartite graph 700. The matrix representation 700A includes the PCM, H, and a code word vector x, where x1, x2, ..., x5 represents bits of the code word x. H is used to determine whether a received signal has been decoded normally. H is a binary matrix with lines C corresponding to j check nodes and columns V corresponding to i variable nodes (that is, a demodulated symbol). The lines represent the equations and the columns represent the bits (also called digits) of the code word. In Figure 7A, H has four rows and five columns corresponding to the four verification nodes and the five variable nodes, respectively. If a check node j-th is connected to a variable i-th node by an edge, that is, the two nodes are neighbors and the edge is represented by a 1 in the i-th column and line j-th of H. That is, the intersection of an i-th line and a j-th column contains a “1” where an edge joins the corresponding vertices and a “0” where there is no border. In some representations, a blank space or a (*) is used to represent no borders. The code word vector x represents a valid code word if and only if H), = 0. Thus, if the code word is received correctly, Hx = 0 (mod 2). When the product of a received encoded signal and the PCM becomes “0”, it means that no error has occurred.
[0090] [0090] The length of the LDPC code corresponds to the number of variable nodes in the bipartite graph. The number of edges (for example, non-zero elements, also called inputs, in the PCM) in a row (column) is defined as the weight of the row (column) dc (dv). The degree of a node refers to the number of edges connected to that node. For example, as shown in Figure 7, variable node 711 has three degrees of connectivity, with edges connected to verification nodes 721, 722 and
[0091] [0091] In the bipartite graph 700 shown in Figure 7, the number of edges incident on a variable node 710 is equal to the number of l in the corresponding column in the PCM
[0092] [0092] "Elevation" allows LDPC code to be implemented using parallel coding and / or decoding implementations, in addition to reducing the complexity normally associated with large LDPC codes. The upgrade helps to allow efficient parallelization of LDPC decoders while still having a relatively compact technical description for generating a relatively large LDPC code from multiple copies of a smaller base code. For example, an elevated LDPC code can be generated by producing parallel Z copies of the base graph (for example, prototype) and then interconnecting the parallel copies through permutations of edge sets of each copy of the base graph. The base graph defines the (macro) structure of the code and consists of a number (K) of columns of information bits and a number (N) of columns of code bits. The graph results in a final block length of KZ. Thus, a larger graph can be obtained by a “copy and swap” operation, in which several copies of the basic graph are made and a single elevated graph is connected to the ceiling. For multiple copies, as the borders are a set of copies of the single base border, they are interchanged and connected to create a connected chart Z times larger than the base chart. Figure 8 is an elevated split graph 900 illustrating elevations of three copies of Figure 700 split graph
[0093] [0093] A corresponding PCM of the elevated graph can be constructed from the PCM of the base graph (also known as the “PCM base”) by replacing each entry in the base PCM with a Z x Z matrix. The entries “0 ”(Either blank or (*)) (those without base borders) are replaced by matrix 0 and non-zero entries (indicating a base border) are replaced by a Z x Z permutation matrix. cyclic elevations, permutations are cyclical permutations.
[0094] [0094] A cyclically high LDPC code can also be interpreted as a code on the binary polynomial ring module xz + 1. In this interpretation, a binary polynomial, (x) = b0 + blx + b2x2 + ... + bz- 1xz-l can be associated with each variable node in the base graph. The binary vector (b0, b1, b2, ..., bz-1) corresponds to the bits associated with the corresponding Z variable nodes in the elevated graph, that is, Z copies of a single variable node. A cyclic permutation by k of the binary vector is obtained by multiplying the corresponding binary polynomial by xk where the multiplication is done in module xZ + 1. A parity check in degrees d in the base graph can be interpreted as a linear constraint in the binary polynomials neighbors B1 (x), ..., Bd (x), written as xk1B1 (x) + xk2B2 (x) + ... + xkdBd (x) = 0xk1B1 (x) + xk2B2 (x) + ... + xkdBd (x) = 0, the values, k1, ..., kd are the cyclic elevation values associated with the corresponding edges. This resulting equation is equivalent to the Z parity checks on the cyclically elevated Tanner chart, corresponding to the associated single parity check on the base chart. Thus, the PCM for the elevated graph can be expressed using the matrix of the base graph in which entries “1” are replaced by monomials in Xk format and entries “0” are raised as 0, but now 0 is interpreted as the The binary polynomial module xZ + 1. This matrix can be written by giving the value k instead of xk. In this case, the polynomial 0 is sometimes represented as “-1” and sometimes as another character to distinguish it from x0.
[0095] [0095] Typically, a square submatrix of the PCM represents the code parity bits. The complementary columns correspond to the bits of information that, at the time of coding, are defined equal to the bits of information to be coded. The coding can be achieved by solving the variables in the square submatrix mentioned above, in order to satisfy the parity verification equations. The PCM can be partitioned into two parts M and N, where M is the square portion. Thus, the codification is reduced to solve Mc = s = Nd where c and d comprise x. In the case of quasi-cyclic codes or cyclically high codes, the above algebra can be interpreted as being on the xZ + 1 binary polynomial module ring.
[0096] [0096] An received LDPC codeword can be decoded to produce a reconstructed version of the original codeword. In the absence of errors, or in the case of correctable errors, decoding can be used to recover the original data unit that was encoded. Redundant bits can be used by decoders to detect and correct bit errors. LDPC decoders generally operate by performing local calculations iteratively and transmitting these results by exchanging messages within the split graph along the edges and updating these messages by performing calculations on the nodes based on the messages received. These steps can be repeated several times. For example, each variable node 710 in graphic 700 may initially be provided with a “flexible bit” (for example, representing the bit received from the codeword) that indicates an estimate of the value of the associated bit, as determined by the observations of the communications. Using these raw bits, LDPC decoders can update messages by reading iteratively,
[0097] [0097] LDPC codes designed for high-speed applications generally use quasi-cyclical constructions with large elevation factors and relatively small base graphics to support high parallelism in encoding and decoding operations. LDPC codes with higher code rates (for example, the ratio of the message size to the length of the code word) tend to have relatively less parity checks. If the number of base parity checks is less than the degree of a variable node (for example, the number of edges connected to a variable node), in the base graph, that variable node will be connected to at least one of the parities of base checks for two or more edges (for example, the variable node may have a double edge). Or if the number of base parity checks is less than the degree of a variable node (for example, the number of edges connected to a variable, in the base graph, that variable node is connected to at least one of the parity checks base by two or more edges Having a base variable node and a base check node connected by two or more edges is generally undesirable for the purpose of implementing parallel hardware. For example, these double edges can result in multiple simultaneous reading and writing to the same memory locations, which in turn can create data coherence problems A double border in a base LDPC code can trigger parallel reading of the same memory location of the soft bit value twice during a single parallel parity check update, so additional circuitry is usually required to match the flexible bit values that are written back into memory to incorporate r properly the two updates. However, the elimination of double borders in the LDPC code helps to avoid the extra complexity of Chis.
[0098] [0098] In the definition of standard irregular LDPC code sets (degree distributions) all edges in Tanner's graphical representation can be statistically interchangeable. In other words, there is a single class of statistical edge equivalence. For multi-edge LDPC codes, multiple edge equivalence classes may be possible. While in defining the standard irregular LDPC set, the nodes in the graph (variables and constraints) are specified by their degree, that is, the number of edges to which they are connected, in the configuration of the type of multiple edges, a degree of edge is a vector; specifies the number of edges connected to the node for each edge equivalence class (type) independently. A multi-border type set consists of a finite number of border types. The degree type of a constraint node is a vector of integers (not negative); the i-th entry of this vector records the number of sockets of the i-th type connected to that node. This vector can be called the degree of border. The degree type of a variable node has two parts, although it can be seen as a vector of integers (non-negative). The first part refers to the distribution received and will be called the received degree and the second part specifies the degree of the border. The degree of the edge plays the same role as constraint nodes. Edges are typed when pairing sockets of the same type. This restriction, that the sockets must pair with sockets of the same type, characterizes the concept of type with multiple edges. In a multi-border type description, different types of nodes can have different distributions received (for example, the associated bits can pass through different channels).
[0099] [0099] Puncture is the act of removing bits from a code word to produce a shorter code word. The punctured variable nodes correspond to the bits of the code word that are not actually transmitted. Punching a variable node in an LDPC code creates a reduced code (for example, due to the removal of a bit), in addition to effectively removing a verification node. If the variable node to be punctured has a degree of one, puncturing the variable node will remove the associated bit from the code and effectively remove its single neighboring check node from the graph. As a result, the number of verification nodes in the graph is reduced by one.
[0100] [0100] Figure 9 is a simplified block diagram that illustrates an encoder, according to certain aspects of the present disclosure. Figure 9 is a simplified block diagram 900 that illustrates a portion of a radio frequency (RF) modem 950 that can be configured to provide a signal including a punctured coded message for wireless transmission.
[0101] [0101] The decoders and decoding algorithms used to decode LDPC code words operate by exchanging messages on the graph along the edges and updating these messages by performing calculations on the nodes based on the messages received. Each variable node in the graph is initially provided with a flexible bit, called the received value, which indicates an estimate of the value of the associated bit, as determined by observations of the communication channel, for example. Ideally, estimates for separate bits are statistically independent; however, this ideal can be violated in practice. A received code word consists of a collection of received values.
[0102] [0102] Figure 10 is a simplified block diagram that illustrates a decoder, in accordance with certain aspects of the present disclosure. Figure 10 is a simplified schematic diagram 1000 illustrating a portion of an RF modem 1050 that can be configured to receive and decode a wirelessly transmitted signal, including a punctured coded message. The punched code word bits can be treated as cleared. For example, the log likelihood ratios (LLRs) of the punctured nodes can be set to 0 at startup. In several examples, the modem 1050 that receives the signal can reside in a receiving device, such as a UE (for example, UE 120) in the downlink or a BS (for example, BS 120) in the uplink. An antenna 1002 provides an RF signal 1020 to the receiving device. An RF chain 1004 processes and demodulates the RF signal 1020 and can provide a sequence of symbols 1022 to a demapper 1006, which produces a 1024 bit stream representative of the encoded message.
[0103] [0103] The demapper 1006 provides a 1024 unstrung bit stream. In some examples, the demapper 1006 includes a demapping module that can be configured to insert null values at locations in the bit stream where the punctured bits have been deleted by the transmitter. The scrub module can be used when the punch pattern 1010 used to produce the bit stream punctured at the transmitter is known. The punch panel 1010 can be used to identify ignored LLRs 1028 during the decoding of the 1024 bit stream by the decoder
[0104] [0104] In some examples, decoder 1008 decodes bits of message information based on LDPC codes with line orthogonality in pairs, in accordance with certain aspects of the present disclosure described in more detail below. In some example, decoder 1008 is a new decoder that exploits the LDPC pair line orthogonality to perform flexible decoder programming without loss of performance.
[0105] [0105] In the new radio (NR), the low density parity check (LDPC) is used for encoding channels of certain channels. As described above in relation to Figures 7-10, LDPC codes are defined by the base graph, including variable nodes and check nodes, and the base graph can be represented by a corresponding parity check matrix (PCM) with columns corresponding to the variable nodes and rows corresponding to the verification nodes. The borders on the base chart have entries in the PCM. Quasi-cyclic LDPC codes have integer cyclic elevation values at non-zero inputs in the PCM for the i-th column and the j-th line. The cyclic elevation values correspond to the permutations of the edges when the base graph rises to obtain a high graph. The number of elevators, Z, is the value of the elevation or elevation size. Different Z values for the base graph are used to support different block lengths. For each supported elevation, the change coefficients are calculated as a function of the elevation size and the cyclic elevation value as: The reduction can be applied before LDPC encoding. The systematic bits can be punched.
[0106] [0106] Aspects of the present disclosure provide LDPC encoders using LDPC codes with orthogonality in pairs of adjacent lines in the PCM that describe the LDPC and code decoders that can exploit LDPC encoding with the orthogonality of the pairs in line to perform programming decoder without loss of performance.
[0107] [0107] In NR, the PCM for some basic graphics used for LDPC encoding has the PCM 1100 structure shown in Figure 11. The PCM 1100 structure includes a top portion with the 1102 region corresponding to the system bits; the region 1104 corresponding to the parity bits; and region 1106 corresponding to the hybrid automatic repeat request (HARQ) extension bits (for example, all zeros). Regions 1102 and 1106 can be rectangular in shape. In some instances, the first two highest-grade systematic bits in region 1102 can be punctured (for example, the first two columns in the PCM). The 1104 region has a square shape. Region 1104 can include a special parity bit. The first or last column in region 1104 can have a weight of 1, while the remaining columns can have a weight of 3 and double diagonal.
[0108] [0108] The PCM 1100 structure also includes a lower portion with region 1108 and region 1110. In some instances, the lower portion of PCM 1100 structure can be used for puncture and / or HARQ for incremental redundancy (IR). Region 1110 can be a diagonal matrix (that is, a diagonal of entries with the remainder having no entries, that is, zero). The lower diagonal structure can ensure that the punch of the parent code does not require decoding of the parent code, thus reducing complexity. The diagonal structure can make the code capable of decoding architecture parallel to the node. The columns of region 1110 can correspond to bits HARQ and region 1108. According to certain aspects, region 1108 (and perhaps also part of region 1110) in the least powerful portion of PCM 1100 structure may have line orthogonality in pairs on each adjacent line.
[0109] [0109] Figure 12 is an example of PCM 1200 for an LDPC code, illustrating the structure of PCM 1100 of Figure 11, in accordance with certain aspects of the present disclosure. In PCM 1200 shown in Figure 12, a “1” represents an entry in the PCM (which can be replaced by a cyclic elevation value Vij) and a “0” represents the absence of an entry. As shown in Figure 12, PCM 1200 includes a bottom portion with line orthogonality in pairs on adjacent lines. As shown, in rows 26 - 46, in columns (for example, columns 1 - 22) before the lower diagonal structure (for example, corresponding to region 1108 before region 1110) and, in some cases, a first portion of region 1110 (for example, columns 23 - 27), in any specified column there are no entries in adjacent (ie consecutive) rows. In other words, the adjacent rows at the bottom of the columns cannot have entries (that is, shown as 0's) or only one has an entry (that is, 1.0 or 0.1), so that there are no entries in any pair of adjacent lines (ie, 1.1 does not occur).
[0110] [0110] Although Figure 12 illustrates an example of PCM with the orthogonality of the line in pairs on lines 26-46, the different numbers of lines can be non-orthogonal. In some examples, in the first potion of the lines of the lower structure (ie region 1108), the first two columns include some non-orthogonality of the lines, while in the remaining columns in the first portion they are non-orthogonal. However, in the second part of the lines in the lower structure, the adjacent lines in all columns are orthogonal. For example, as shown in Figure 12, on lines 6 - 25 in a PCM (for example, a first part of the bottom structure), the adjacent lines in the first two columns (that is, columns 102) are not always orthogonal; however, the adjacent rows in the remaining columns (that is, columns 3 - 27) are orthogonal in pairs. As shown in Figure 12, at the bottom of the bottom structure, rows 26 - 46, all columns in the region (for example, columns 1 - 27) have row orthogonality in pairs.
[0111] [0111] According to certain aspects, at least part of the description of the base graph can be stored on the chip, for example, in BS and / or UE. The description can be a base graph, the PCM or some other representation of the sparse matrix.
[0112] [0112] To retrieve the information bits, the receiver decodes the code word received from the transmitting device. The receiving device can decode according to the decoding schedule. The receiving device can decode the codeword using a layered decoder. The decoding schedule can be based, at least in part, on the stored description of the base graph. The decoding schedule can decode the codeword line by line (for example, using the base graph). The decoding schedule can decode the code word column by column. The decoding schedule can decode the two columns at a time (for example, within a row or pair of rows). The decoding schedule can skip missing entries for decoding.
[0113] [0113] In some examples, the receiving device may use a new decoder with improved performance. The decoder can exploit the LDPC pair orthogonality described here to increase the decoding speed, for example, decoding the code word by pairs of lines at a time, without loss of performance. In addition, the decoder can have greater flexibility in decoding programming due to the orthogonality of the line in pairs, because for any set of three consecutive lines at the bottom of the code, the decoder can select between two different orthogonal combinations for simultaneous decoding.
[0114] [0114] Figure 13 illustrates a communication device 1300 that can include several components (for example, corresponding to the components of means plus function) configured to perform operations for the techniques disclosed herein, such as the operations illustrated in Figure 14 and / or Figure 15. Communication device 1300 includes a processing system 1302 coupled to a transceiver 1308. Transceiver 1308 is configured to transmit and receive signals to communication device 1300 through an antenna 1310, like the various signals described here. Processing system 1302 can be configured to perform processing functions for communication device 1300, including processing signals received and / or to be transmitted by communication device 1300.
[0115] [0115] Processing system 1302 includes a processor 1304 coupled to a computer-readable medium / memory 1312 via a 1306 bus. In certain aspects, the computer-readable medium / memory 1312 is configured to store instructions (for example, code executable by computer) which, when executed by processor 1304, causes processor 1304 to perform the operations illustrated in Figure 14 and / or Figure 15, or other operations to perform the various techniques discussed here for encoding LDPC with line orthogonality in pairs. In certain respects, computer-readable medium / memory 1512 stores code 1314 to encode bits of information using LDPC code with line orthogonality in pairs; code 1316 for transmitting the code word over a wireless channel; code 1318 to receive a code word; and code 1320 to decode the codeword using the LDPC code with line orthogonality in pairs to obtain bits of information.
[0116] [0116] Figure 14 is a flow diagram illustrating exemplary operations 1400 for wireless communications by a receiving device using LDPC encryption, in accordance with certain aspects of the present disclosure. The receiving device can be a BS (for example, as a BS 110 on the wireless communication network 100) on the uplink or a UE (for example, as a UE 120 on the wireless communication network 100) on the downlink.
[0117] [0117] Operations 1400 begin, in 1402, receiving a code word (for example, or punctured code word) according to a radio technology (for example, NR or 5G radio technology) through a channel without through one or more antenna elements located near a receiver.
[0118] [0118] Figure 15 is a flow diagram illustrating an example of operations 1500 for wireless communication by a transmission device using LDPC encryption, in accordance with certain aspects of the present disclosure. The transmission device can be a UE (for example, as a UE 120 on the wireless communication network 100) on the uplink or a BS (for example, as a BS 121 on the wireless communication network 100) on the downlink. Operations 1500 can be complementary to operations 1400 by the receiving device.
[0119] [0119] Operations 1500 begin, in 1502, encoding a set of bits of information with a set of encoder circuits based on an LDPC code to produce a codeword. The LDPC code is defined by a base matrix having a first number of columns corresponding to variable nodes in a base chart and a second number of corresponding lines to check nodes in the base chart. For each of the first number of columns, all adjacent rows are orthogonal to a last portion of the second number of rows. In 1504, the transmission device transmits the code word according to a radio technology through a wireless channel through one or more antenna elements.
[0120] [0120] The methods disclosed in this document comprise one or more steps or actions to achieve the methods. The steps and / or actions of the method can be exchanged with each other without departing from the scope of the claims. In other words, unless a specific order of steps or actions is specified, the order and / or use of specific steps and / or actions can be modified without departing from the scope of the claims.
[0121] [0121] As used here, a phrase that refers to “at least one of” a list of items refers to any combination of those items, including unique members. As an example, “at least one of: a, b, or c” is intended to cover a, b, c, ab, ac, bc, and abc, as well as any combination with multiples of the same element (for example, aa , aaa, aab, aac, abb, acc, bb, bbb, bbc, cc, and ccc or any other request from a, b, and c).
[0122] [0122] As used herein, the term “determination” covers a wide variety of actions. For example, "determination" may include calculation, computation, processing, derivation, investigation, research (for example, searching a table, database or other data structure), verification and the like. In addition, "determining" may include receiving (for example, receiving information), accessing (for example, accessing data in a memory) and the like. In addition, "determining" may include resolving, selecting, choosing, establishing and the like.
[0123] [0123] The previous description is provided to allow anyone skilled in the art to practice the various aspects described here. Various changes in these aspects will be readily apparent to persons skilled in the art, and the generic principles defined herein can be applied to other aspects. Thus, the claims are not intended to be limited to the aspects shown here, but should be given the full scope consistent with the language of the claims, where the reference to an element in the singular is not intended to mean "one and only one" unless that is specifically indicated, but “one or more”. Unless otherwise indicated, the term "some" refers to one or more. All structural and functional equivalents to the elements of the various aspects described throughout this disclosure which are known or later known to persons skilled in the art are expressly incorporated herein by reference and must be covered by the claims. In addition, nothing disclosed in this document is intended to be dedicated to the public, regardless of whether such disclosure is explicitly recited in the claims. No claim element shall be interpreted in accordance with the provisions of 35 USC §112 (f), unless the element is expressly recited using the phrase “means for” or, in the case of a method claim, the element is recited using the phrase “step to”.
[0124] [0124] The various operations of the methods described above can be performed by any suitable means capable of carrying out the corresponding functions. The means may include various components and / or modules of hardware and / or software, including, but not limited to, a circuit, an application specific integrated circuit (ASIC) or processor. Generally, where there are operations illustrated in the figures, these operations may have corresponding components of means plus function with a similar numbering.
[0125] [0125] The various blocks, modules and illustrative logic circuits described in connection with the present disclosure can be implemented or executed with a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), an array of field programmable ports (FPGA) or other programmable logic device (PLD), discrete logic of ports or transistors, discrete hardware components or any combination of them designed to perform the functions described here. A general purpose processor can be a microprocessor, but, alternatively, the processor can be any commercially available processor, controller, microcontroller, or state machine. A processor can also be implemented as a combination of computing devices, for example, a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core or any other configuration.
[0126] [0126] If implemented on hardware, an example of a hardware configuration can comprise a processing system on a wireless node. The processing system can be implemented with a bus architecture. The bus can include any number of interconnecting buses and bridges, depending on the specific application of the processing system and the general design restrictions. The bus can connect several circuits,
[0127] [0127] If implemented in software, functions can be stored or transmitted as one or more instructions or code in a computer-readable medium. The software should be interpreted broadly as instructions, data or any combination thereof, whether it is called software, firmware, middleware, microcode, hardware description language or others. Computer-readable media includes storage media and communication media, including any means that facilitates the transfer of a computer program from one place to another. The processor may be responsible for managing the bus and overall processing, including running software modules stored on machine-readable storage media. A computer-readable storage medium can be coupled to a processor, so that the processor can read information and write information to the storage medium. Alternatively, the storage medium can be an integral part of the processor. For example, machine-readable media may include a transmission line, a data-modulated carrier wave and / or a computer-readable storage medium with stored instructions separate from the wireless node, which can be accessed by the processor via the bus interface. Alternatively, or in addition, machine-readable media, or any part of it, can be integrated into the processor, as is the case with caching and / or general log files. Examples of machine-readable storage media may include, for example, RAM (random access memory), flash memory, ROM (read-only memory), PROM (programmable read-only memory), EPROM (erasable programmable read-only memory) , EEPROM (electrically erasable programmable read-only memory), recorders, magnetic disks, optical disks, hard disks or any other suitable storage medium or any combination thereof. Machine-readable media can be incorporated into a computer program product.
[0128] [0128] A software module can comprise a single instruction, or many instructions, and can be distributed across several different code segments, between different programs and across various storage media. Computer-readable media can comprise several software modules. The software modules include instructions that, when executed by a device such as a processor, cause the processing system to perform various functions. The software modules can include a transmission module and a receiver module. Each software module can reside on a single storage device or be distributed across multiple storage devices. For example, a software module can be loaded into RAM from a hard drive when a trigger event occurs. During the execution of the software module, the processor can load some of the instructions in the cache to increase the access speed. One or more lines of cache can be loaded into a general log file for execution by the processor. When referring to the functionality of a software module below, it will be understood that this functionality is implemented by the processor when executing instructions from that software module.
[0129] [0129] In addition, any connection is properly called a computer-readable medium. For example, if the software is transmitted from a website, server or other remote source using a coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL) or wireless technologies such as infrared (IR), radio and microwave, coaxial cable, fiber optic cable, twisted pair, DSL or wireless technologies such as infrared,
[0130] [0130] Thus, certain aspects may comprise a computer program product to perform the operations presented here. For example, such a computer program product may comprise a computer-readable medium with instructions stored (and / or encoded) on it, the instructions being executable by one or more processors to perform the operations described herein. For example, instructions for performing the operations described here and illustrated in Figure 14 and Figure
[0131] [0131] In addition, it should be appreciated that the modules and / or other appropriate means for carrying out the methods and techniques described herein can be downloaded and / or otherwise obtained by a user terminal and / or base station, as applicable. For example, this device can be coupled to a server to facilitate the transfer of means to execute the methods described here. Alternatively, several methods described in this document can be provided by storage media (for example, RAM, ROM, a physical storage medium, such as a CD (CD) or floppy disk, etc.), so that a user terminal and / or base station can obtain the various methods when coupling or providing the storage media to the device. In addition, any other suitable technique for providing the methods and techniques described herein to a device can be used.
[0132] [0132] It should be understood that the claims are not limited to the precise configuration and component illustrated above. Various modifications, alterations and variations can be made in the arrangement, operation and details of the methods and apparatus described above, without departing from the scope of the claims.

权利要求:
Claims (30)
[1]
1. An apparatus for wireless communication, comprising: a receiver configured to receive a code word according to a radio technology through a wireless channel through one or more antenna elements located near the receiver; and at least one processor coupled to a memory and comprising a set of decoder circuits configured to decode the codeword based on a low density parity check code (LDPC) to produce a set of information bits, where: the LDPC code is stored in memory and defined by a base matrix having a first number of columns corresponding to variable nodes in a base chart and a second number of corresponding lines to check nodes in the base chart, and for each of the first number of columns, all adjacent rows are orthogonal in a last portion of the second number of rows.
[2]
2. Apparatus according to claim 1, in which entries in the base matrix correspond to an edge between the variable node and the check node in the base graph, associated with the entry in the base matrix.
[3]
Apparatus according to claim 2, wherein entries in the base matrix include cyclic integer elevation values.
[4]
Apparatus according to claim 2, wherein in each of the first number of columns, at most one line of each pair of adjacent orthogonal lines in the last portion of the lines has an entry.
[5]
Apparatus according to claim 1, wherein the last portion of the lines comprises at least the twenty-one lower lines of the base matrix.
[6]
Apparatus according to claim 1, wherein the memory is configured to store at least a portion of the LDPC code.
[7]
Apparatus according to claim 1, wherein the at least one processor includes a layered decoder.
[8]
Apparatus according to claim 1, wherein the at least one processor is configured to decode the code word based on a decoding schedule.
[9]
Apparatus according to claim 8, wherein the decoding schedule includes decoding the codeword based on the LDPC code by sequentially decoding line by line in the base matrix or simultaneously decoding pairs of lines in the matrix base.
[10]
Apparatus according to claim 9, wherein the at least one processor is configured to select between two combinations of two lines of any three sequential lines in the last portion for the simultaneous decoding pairs of the decoding schedule.
[11]
Apparatus according to claim 9, wherein the line by line or pairs of lines is performed column by column.
[12]
Apparatus according to claim 8, wherein the decoding schedule includes skipping decoding portions of the base matrix that do not contain an associated entry.
[13]
Apparatus according to claim 1, wherein the LDPC code comprises a high LDPC code.
[14]
Apparatus according to claim 1, wherein: the code word comprises a punctured code word, the at least one processor further comprises a depunker configured to depuncate the code word, and decoding comprises decoding the unpunished code.
[15]
15. An apparatus for wireless communication, comprising: at least one processor coupled to a memory and comprising an encoder circuit configured to encode a set of information bits based on a low density parity check code (LDPC) to produce a codeword where: the LDPC code is stored in memory and defined by a base matrix having a first number of columns corresponding to variable nodes in a base chart and a second number of corresponding lines to check nodes in the base chart , and for each of the first number of columns, all adjacent lines are orthogonal to a last portion of the second number of lines, and a transmitter configured to transmit the code word according to radio technology over a wireless channel through one or more antenna elements arranged close to the transmitter.
[16]
An apparatus according to claim 15, wherein entries in the base matrix correspond to an edge between the variable node and the check node, of the base graph, associated with the entry in the base matrix.
[17]
Apparatus according to claim 16, wherein entries in the base matrix are substituted cyclic integer elevation values.
[18]
Apparatus according to claim 16, wherein in each of the first number of columns, at most one line from each pair of adjacent orthogonal lines in the last portion of the lines has an entry.
[19]
An apparatus according to claim 15, wherein the last portion of the lines comprises at least the bottom twenty-one lines of the base matrix.
[20]
20. Apparatus according to claim 15, wherein: the at least one processor is configured to elevate the LDPC code generating an integer number of copies of the base matrix, and the LDPC code comprises an LDPC code high.
[21]
21. Apparatus according to claim 15, wherein: the at least one processor further comprises a puncher configured to punch the code word, and the transmission of the code word comprises transmitting the punctured code word.
[22]
22. Method for wireless communication, comprising: receiving a code word according to a radio technology over a wireless channel through one or more antenna elements located near a receiver; and decode the codeword through the decoder circuitry based on a low density parity check code (LDPC) to produce a set of information bits, where: the LDPC code is stored and defined by a base matrix having a first number of columns corresponding to variable nodes in a base graph and a second number of corresponding lines to check nodes in the base graph, and for each of the first number of columns, all adjacent lines are orthogonal in one last portion of the second number of lines.
[23]
23. The method of claim 22, wherein in each of the first number of columns, at most one line from each pair of adjacent orthogonal lines in the last portion of the lines has an entry.
[24]
24. The method of claim 22, wherein the last portion of the lines comprises at least the bottom twenty-one lines of the base matrix.
[25]
25. The method of claim 22, wherein:
decoding is based on a decoding schedule; and the decoding schedule includes decoding the codeword based on the LDPC code by sequentially decoding line by line in the base matrix or simultaneously decoding pairs of lines in the base matrix.
[26]
26. The method of claim 25, further comprising selecting between two combinations of two lines of any three sequential lines in the last portion for the simultaneous decoding pairs of the decoding schedule.
[27]
27. Method for wireless communication, comprising: encoding a set of information bits with encoder circuitry based on a low density parity check code (LDPC) to produce a code word where: the code for LDPC is defined by a base matrix having a first number of columns corresponding to variable nodes in a base graph and a second number of corresponding lines to check nodes in the base graph, and for each of the first number of columns, all adjacent lines are orthogonal in a last portion of the second number of lines; and transmitting the code word according to radio technology over a wireless channel through one or more antenna elements.
[28]
28. The method of claim 27, wherein in each of the first number of columns, at most one line from each pair of adjacent orthogonal lines in the last portion of the lines has an entry.
[29]
29. The method of claim 27, wherein the last portion of the lines comprises at least the bottom twenty-one lines of the base matrix.
[30]
30. The method of claim 27, further comprising punching the code word, wherein transmitting the code word comprises transmitting the punctured code word.

类似技术:

---

公开号 | 公开日 | 专利标题

---

BR112019025741A2|2020-06-23|CODING AND DECODING QC-LDPC CODES WITH ORTOGONALITY IN PAIRS OF ADJACENT LINES IN THEIR BASE MATRICES

---

KR102113450B1|2020-05-20|Communication technology using low density parity check code base graph selection

---

US10469104B2|2019-11-05|Methods and apparatus for compactly describing lifted low-density parity-check | codes

---

EP3642985B1|2021-05-26|Communication techniques with self-decodable redundancy versions | using systematic codes

---

TWI692211B|2020-04-21|Enhanced puncturing and low-density parity-check | code structure

---

US11043966B2|2021-06-22|Methods and apparatus for efficiently generating multiple lifted low-density parity-check | codes

---

US20190349900A1|2019-11-14|Direct transport block size specification

---

TWI756445B|2022-03-01|Communication techniques applying low-density parity-check code base graph selection

同族专利:

---

公开号 | 公开日

---

KR102178603B1|2020-11-13|

---

US20180358984A1|2018-12-13|

---

KR20190140082A|2019-12-18|

---

JP6932791B2|2021-09-08|

---

EP3635869A1|2020-04-15|

---

US10312939B2|2019-06-04|

---

TW201909568A|2019-03-01|

---

JP2020522951A|2020-07-30|

---

CN110710111A|2020-01-17|

---

CA3061475A1|2018-12-13|

---

JP2021119685A|2021-08-12|

---

CN110710111B|2020-11-17|

---

WO2018227133A1|2018-12-13|

引用文献:

---

公开号 | 申请日 | 公开日 | 申请人 | 专利标题

---

---

US5583500A|1993-02-10|1996-12-10|Ricoh Corporation|Method and apparatus for parallel encoding and decoding of data|

---

US5844918A|1995-11-28|1998-12-01|Sanyo Electric Co., Ltd.|Digital transmission/receiving method, digital communications method, and data receiving apparatus|

---

CA2295791C|1997-07-30|2006-06-13|Chang Soo Park|Adaptive channel encoding method and device|

---

US6633865B1|1999-12-23|2003-10-14|Pmc-Sierra Limited|Multithreaded address resolution system|

---

US6931581B1|2000-10-25|2005-08-16|Sun Microsystems, Inc.|Method for superimposing a sequence number in an error detection code in a data network|

---

WO2002078196A1|2001-03-22|2002-10-03|University Of Florida|Method and coding means for error-correction utilizing concatenated parity and turbo codes|

---

US6633856B2|2001-06-15|2003-10-14|Flarion Technologies, Inc.|Methods and apparatus for decoding LDPC codes|

---

KR100762632B1|2001-10-17|2007-10-01|삼성전자주식회사|Apparatus for multiplexing/demultiplexing channel in code division multiple access communication system and method thereof|

---

US6854082B1|2001-11-27|2005-02-08|Lsi Logic Corporation|Unequal error protection Reed-Muller code generator and decoder|

---

US6961888B2|2002-08-20|2005-11-01|Flarion Technologies, Inc.|Methods and apparatus for encoding LDPC codes|

---

US6957375B2|2003-02-26|2005-10-18|Flarion Technologies, Inc.|Method and apparatus for performing low-density parity-check code operations using a multi-level permutation|

---

KR100955952B1|2003-10-13|2010-05-19|삼성전자주식회사|Method and apparatus for space-time coding using lifting low density parity check codes in a wireless communication system|

---

KR100918763B1|2003-11-14|2009-09-24|삼성전자주식회사|Interleaving apparatus and method in a channel coder using a parallel concatenated low density parity check code|

---

US7526717B2|2004-06-16|2009-04-28|Samsung Electronics Co., Ltd.|Apparatus and method for coding and decoding semi-systematic block low density parity check codes|

---

US20050283707A1|2004-06-22|2005-12-22|Eran Sharon|LDPC decoder for decoding a low-density parity check codewords|

---

US7395490B2|2004-07-21|2008-07-01|Qualcomm Incorporated|LDPC decoding methods and apparatus|

---

US7346832B2|2004-07-21|2008-03-18|Qualcomm Incorporated|LDPC encoding methods and apparatus|

---

US7571369B2|2005-02-17|2009-08-04|Samsung Electronics Co., Ltd.|Turbo decoder architecture for use in software-defined radio systems|

---

KR101157246B1|2005-05-16|2012-06-15|삼성전자주식회사|Padding and puncturing method for ldpc channel code|

---

US7571372B1|2005-06-23|2009-08-04|Marvell International Ltd.|Methods and algorithms for joint channel-code decoding of linear block codes|

---

US8213291B2|2005-06-29|2012-07-03|Intel Corporation|Wireless data transmission methods, devices, and systems|

---

KR100929079B1|2005-10-31|2009-11-30|삼성전자주식회사|Decoding Apparatus and Method of Communication System Using Low Density Parity Check Code|

---

TWI303414B|2005-12-21|2008-11-21|Ind Tech Res Inst|A data encoding method for error correcton|

---

US8132072B2|2006-01-06|2012-03-06|Qualcomm Incorporated|System and method for providing H-ARQ rate compatible codes for high throughput applications|

---

US7979784B2|2006-03-29|2011-07-12|Samsung Electronics Co., Ltd.|Method and system for enhancing transmission reliability of video information over wireless channels|

---

KR101191196B1|2006-06-07|2012-10-15|엘지전자 주식회사|Method of encoding and decoding using a parity check matrix|

---

US7840880B1|2006-09-25|2010-11-23|Altera Corporation|Methods and apparatus for error checking code computation|

---

US8464120B2|2006-10-18|2013-06-11|Panasonic Corporation|Method and system for data transmission in a multiple input multiple output system including unbalanced lifting of a parity check matrix prior to encoding input data streams|

---

US7986622B2|2006-10-24|2011-07-26|Broadcom Corporation|Method and system for physical layer aggregation|

---

CA2664918C|2006-10-26|2014-06-03|Qualcomm Incorporated|Coding schemes for wireless communication transmissions|

---

KR101280477B1|2007-01-24|2013-07-01|퀄컴 인코포레이티드|Ldpc encoding and decoding of packets of variable sizes|

---

JPWO2008093717A1|2007-01-31|2010-05-20|パナソニック株式会社|Wireless communication apparatus and puncturing method|

---

US8418015B2|2007-06-08|2013-04-09|China Academy Of Telecommunications Technology|Method, apparatus and system for coding and decoding of LDPC codes|

---

CN101325474B|2007-06-12|2012-05-09|中兴通讯股份有限公司|Method for encoding channel of mixed automatic request retransmission and modulation mapping of LDPC code|

---

CN101682381B|2007-06-15|2013-06-05|松下电器产业株式会社|Radio communication device, radio communication system, and radio communication method|

---

KR100928261B1|2007-09-08|2009-11-24|엘지전자 주식회사|Signal Division and RC Attachment Method for Non-Detection Error Reduction|

---

JPWO2009041034A1|2007-09-27|2011-01-13|パナソニック株式会社|Wireless communication apparatus, wireless communication system, and wireless communication method|

---

PL2381583T3|2007-12-06|2013-09-30|Samsung Electronics Co Ltd|Method and apparatus for channel decoding in a communication system using low-density parity-check codes|

---

KR101445080B1|2008-02-12|2014-09-29|삼성전자 주식회사|Method and apparatus for transmitting signal in a communication systemusing a hybrid automatic repeat request scheme|

---

KR101503059B1|2008-02-26|2015-03-19|삼성전자주식회사|Apparatus and method for channel encoding and decoding in communication system using low-density parity-check codes|

---

US20090300461A1|2008-05-29|2009-12-03|Gadi Shor|Device, method and computer program product for communication|

---

US8347199B2|2009-01-21|2013-01-01|Cisco Technology, Inc.|Enhanced error detection in multilink serdes channels|

---

US8433972B2|2009-04-06|2013-04-30|Nec Laboratories America, Inc.|Systems and methods for constructing the base matrix of quasi-cyclic low-density parity-check codes|

---

US8495450B2|2009-08-24|2013-07-23|Samsung Electronics Co., Ltd.|System and method for structured LDPC code family with fixed code length and no puncturing|

---

US9634693B2|2010-08-12|2017-04-25|Samsung Electronics Co., Ltd|Apparatus and method for decoding LDPC codes in a communications system|

---

US8560911B2|2009-09-14|2013-10-15|Samsung Electronics Co., Ltd.|System and method for structured LDPC code family|

---

JP5073770B2|2010-02-19|2012-11-14|株式会社エヌ・ティ・ティ・ドコモ|Mobile terminal apparatus, radio base station apparatus, and radio communication method|

---

US8687751B1|2010-04-02|2014-04-01|Marvell International Ltd.|Multiple-input multiple-output receivers using successive interference cancellation based on cyclic redundancy check|

---

US8627166B2|2011-03-16|2014-01-07|Samsung Electronics Co., Ltd.|LDPC code family for millimeter-wave band communications in a wireless network|

---

KR20120137198A|2011-06-11|2012-12-20|삼성전자주식회사|Apparatus and method for transmitting and receiving packet in communication system|

---

US9176927B2|2011-11-08|2015-11-03|The Royal Institution For The Advancement Of Learning/Mcgill University|Methods and systems for decoding polar codes|

---

CN103220001B|2012-01-20|2016-09-07|华为技术有限公司|The interpretation method of polar code and code translator with cyclic redundancy check cascade|

---

US9503126B2|2012-07-11|2016-11-22|The Regents Of The University Of California|ECC polar coding and list decoding methods and codecs|

---

US9454552B2|2012-07-31|2016-09-27|Empire Technology Development Llc|Entropy coding and decoding using polar codes|

---

CN108809512B|2012-10-17|2019-05-07|华为技术有限公司|A kind of method, apparatus and system of coding and decoding|

---

KR102007770B1|2012-12-14|2019-08-06|삼성전자주식회사|Packet coding method and for decoding apparatus and method therof|

---

US9602241B2|2013-12-17|2017-03-21|Samsung Electronics Co., Ltd.|Computing system with polar processing mechanism and method of operation thereof|

---

US9178653B2|2013-01-16|2015-11-03|Broadcom Corporation|Very short size LDPC coding for physical and/or control channel signaling|

---

US9362956B2|2013-01-23|2016-06-07|Samsung Electronics Co., Ltd.|Method and system for encoding and decoding data using concatenated polar codes|

---

CN104981978B|2013-02-13|2017-12-08|高通股份有限公司|Using quasi- looping construct and perforate to realize that the LDPC of high-speed, high concurrency and low error floor is designed|

---

CN104038234B|2013-03-07|2017-09-29|华为技术有限公司|The interpretation method and decoder of polar code|

---

US9432143B2|2013-06-06|2016-08-30|Broadcom Corporation|Combining CRC and FEC on a variable number of NCPs|

---

CN103746708A|2013-10-25|2014-04-23|中国农业大学|Method for constructing Polar-LDPC concatenated codes|

---

US9787470B2|2013-12-12|2017-10-10|Samsung Electronics Co., Ltd.|Method and apparatus of joint security advanced LDPC cryptcoding|

---

US9319073B2|2014-02-11|2016-04-19|Seagate Technology Llc|Mitigation of write errors in multi-level cell flash memory through adaptive error correction code decoding|

---

US10193578B2|2014-07-10|2019-01-29|The Royal Institution For The Advancement Of Learning / Mcgill University|Flexible polar encoders and decoders|

---

US9432052B2|2014-09-18|2016-08-30|Broadcom Corporation|Puncture-aware low density parity check decoding|

---

US9654144B2|2014-09-30|2017-05-16|Micron Technology, Inc.|Progressive effort decoder architecture|

---

US9692451B2|2014-09-30|2017-06-27|Avago Technologies General Ip Pte. Ltd|Non-binary low density parity check codes for communication systems|

---

US9954645B2|2014-12-05|2018-04-24|Lg Electronics Inc.|Method and device for providing secure transmission based on polar code|

---

US20160164537A1|2014-12-08|2016-06-09|Samsung Electronics Co., Ltd.|Method and apparatus for parallel concatenated ldpc convolutional codes enabling power-efficient decoders|

---

US20160173132A1|2014-12-10|2016-06-16|Alcatel-Lucent Usa Inc.|Construction of Structured LDPC Convolutional Codes|

---

US20160218750A1|2015-01-23|2016-07-28|Empire Technology Development Llc|Parity check code encoder|

---

US9479375B1|2015-04-02|2016-10-25|University Of South Florida|Joint physical layer security and PAPR mitigation in OFDM systems|

---

US10231121B2|2015-06-24|2019-03-12|Lg Electronics Inc.|Security communication using polar code scheme|

---

US10461779B2|2015-08-12|2019-10-29|Telefonaktiebolaget Lm Ericsson |Rate-compatible polar codes|

---

CN105227189B|2015-09-24|2019-01-01|电子科技大学|It is segmented the polarization code coding/decoding method of CRC auxiliary|

---

US10523364B2|2015-11-06|2019-12-31|Samsung Electronics Co., Ltd.|Channel coding framework for 802.11AY and larger block-length LDPC codes for 11AY with 2-step lifting matrices and in-place property|

---

US10784901B2|2015-11-12|2020-09-22|Qualcomm Incorporated|Puncturing for structured low density parity check codes|

---

WO2017091244A1|2015-11-23|2017-06-01|Intel IP Corporation|Hybrid arq schemes based on low density parity check codes|

---

US11043966B2|2016-05-11|2021-06-22|Qualcomm Incorporated|Methods and apparatus for efficiently generating multiple lifted low-density parity-check codes|

---

US10454499B2|2016-05-12|2019-10-22|Qualcomm Incorporated|Enhanced puncturing and low-density parity-check code structure|

---

EP3264611A1|2016-05-12|2018-01-03|MediaTek Inc.|Qc-ldpc coding methods and apparatus|

---

US10313057B2|2016-06-01|2019-06-04|Qualcomm Incorporated|Error detection in wireless communications using sectional redundancy check information|

---

US9917675B2|2016-06-01|2018-03-13|Qualcomm Incorporated|Enhanced polar code constructions by strategic placement of CRC bits|

---

US20170353267A1|2016-06-01|2017-12-07|Qualcomm Incorporated|Generalized polar code construction|

---

US10291354B2|2016-06-14|2019-05-14|Qualcomm Incorporated|High performance, flexible, and compact low-density parity-check code|

---

CN109478959B|2016-07-27|2021-08-06|高通股份有限公司|Design of hybrid automatic repeat request feedback bits for polar codes|

---

CN106341138B|2016-09-05|2019-05-10|厦门大学|Joint source-channel coding Matrix Construction Method based on protograph LDPC code|

---

WO2018128559A1|2017-01-09|2018-07-12|Huawei Technologies Co., Ltd.|Efficiently decodable qc-ldpc code|

---

US10594339B2|2017-02-03|2020-03-17|Huawei Technologies Co., Ltd.|Method for generating parity check matrix for low density parity check coding|

---

RU2720950C1|2017-02-03|2020-05-15|Идак Холдингз, Инк.|Code block segmentation depending on selection of base matrix ldpc|

---

US20180367245A1|2017-06-19|2018-12-20|Qualcomm Incorporated|COMMUNICATION TECHNIQUES WITH SELF-DECODABLE REDUNDANCY VERSIONS USING SYSTEMATIC CODES|

---

WO2019018120A1|2017-07-07|2019-01-24|Qualcomm Incorporated|Communication techniques applying low-density parity-check code base graph selection|US10784901B2|2015-11-12|2020-09-22|Qualcomm Incorporated|Puncturing for structured low density parity checkcodes|

---

US10454499B2|2016-05-12|2019-10-22|Qualcomm Incorporated|Enhanced puncturing and low-density parity-checkcode structure|

---

US10313057B2|2016-06-01|2019-06-04|Qualcomm Incorporated|Error detection in wireless communications using sectional redundancy check information|

---

US9917675B2|2016-06-01|2018-03-13|Qualcomm Incorporated|Enhanced polar code constructions by strategic placement of CRC bits|

---

US10291354B2|2016-06-14|2019-05-14|Qualcomm Incorporated|High performance, flexible, and compact low-density parity-checkcode|

---

CN109478959B|2016-07-27|2021-08-06|高通股份有限公司|Design of hybrid automatic repeat requestfeedback bits for polar codes|

---

US10868569B2|2017-05-08|2020-12-15|Qualcomm Incorporated|PBCH signal design and efficient continuous monitoring and polar decoding|

---

CN108988869B|2017-05-31|2021-07-30|大唐移动通信设备有限公司|Method and device for determining check matrix and computer storage medium|

---

US10560910B2|2017-06-12|2020-02-11|Qualcomm Incoporated|Synchronization signal for a broadcast channel|

---

WO2019018120A1|2017-07-07|2019-01-24|Qualcomm Incorporated|Communication techniques applying low-density parity-check code base graph selection|

---

US10637503B2|2018-08-03|2020-04-28|Innogrit Technologies Co., Ltd.|Systems and methods for decoding low density parity check encoded codewords|

---

KR102340895B1|2020-08-28|2021-12-20|고려대학교 산학협력단|Network scheduling apparatus and method using quantum approximation|

法律状态:
2021-11-03| B350| Update of information on the portal [chapter 15.35 patent gazette]|

优先权:

---

申请号 | 申请日 | 专利标题

---

US201762517916P| true| 2017-06-10|2017-06-10|

---

US62/517,916|2017-06-10|

---

US201762522044P| true| 2017-06-19|2017-06-19|

---

US62/522,044|2017-06-19|

---

US16/003,047|US10312939B2|2017-06-10|2018-06-07|Communication techniques involving pairwise orthogonality of adjacent rows in LPDC code|

---

US16/003,047|2018-06-07|

---

PCT/US2018/036726|WO2018227133A1|2017-06-10|2018-06-08|Encoding and decoding of qc-ldpc codes with pairwise orthogonality of adjacent rows in their base matrices|

---